Processing Power to Chess Rating Ratio

50 here is what the Deep Thought team wrote about the relationship between search depth and chess strength in a 1989 article: The ascent of the brute-force chess machines back in the late 1970s made one thing crystal clear: there is a strong causal relationship between the search speed of a chess machine and its playing strength. In fact, it appeared from machine self-test games that every time a machine searches one extra ply, its rating increases by about 200-250 rating points. Since each...

 Today's Wants Become Tomorrow's Needs

"The pie keeps growing because things that look like wants today are needs tomorrow," argued Marc Andreessen, the Netscape cofounder, who lelped to ignite a whole new industry, e-commerce, that now employs mil)ns of specialists around the wodd, specialists whose jobs weren't even lagined when Bill Clinton became president. I like going to coflfee shops occasionally, but now that Starbucks is here, I need my coffee, and that new need has spawned a whole new industry. I always wanted to be able...

 Internet-Literate Student Skills

An understanding of what the Internet is. "I found it on the Internet" is not an accurate statement. You found it on a computer connected to the World Wide Web. Ways to formulate queries. Typing "childhood obesity" into a search engine is not the best way to discover what health problems are associated with being overweight. Students need to know about Boolean searches, adding prefixes such as SITE and FILETYPE, and more. For example, "site:.edu childhood obesity" will yield search results fr...

 How IBM's Watson Pattern-Matches to Answer Trivia

The way Watson plays the game also requires massive amounts of pattern matching. The supercomputer has been loaded with hundreds of millions of unconnected digital documents, including encyclopedias and other reference works, newspaper stories, and the Bible. When it receives a question, it immediately goes to work to figure out what is being asked (using algorithms that specialize in complex communication), then starts querying all these documents to find and match patterns in search of the ...

 Page Rank Algorithm and the Kleinberg's HITS algorithm

The most famous quality measure is PageRank [221], discussed earlier, which builds on the intuition that a page which is cited by many other pages is likely to be of significant quality. The insight of PageRank is that the obvious way to subvert that model is to set up a load of dummy pages to cite the page which one wanted to boost. But if a page is cited by many other pages which themselves have a high PageRank, then it is likely to be of high quality. The PageRank method has another intuit...